minimum consist subset cover problem applic data mine byron gao martin ester jin yi cai oliv schult hui xiong paper introduc studi minimum consist subset cover mcsc problem finit ground set constraint find minimum number consist subset cover subset consist satisfi mcsc problem gener tradit set cover problem minimum cliqu partit dual problem graph color instanc practic data mine problem area rule learn cluster frequent pattern mine formul mcsc instanc discuss minimum rule set problem minim model complex decis rule convers cluster problem minim number cluster satisfi distanc constraint show mcsc problem find applic frequent pattern summar mcsc formul propos graph base gener algorithm cag directli applic cag start construct maxim optim partial solut perform driven specif gener search dynam maintain bipartit assign graph simultan learn set consist subset small cardin cover ground set experi benchmark dataset show cag achiev good result compar exist popular heurist 